In memory computation using quantum‐dot cellular automata

Emergent Computation in Cellular Automata

We study the ability of a genetic algorithm to design cellular automata exhibiting spontaneous global synchronization. We show that in order to produce emergent coordination , the evolutionary process can take advantage of the underlying medium's potential to form embedded particles. The particles, typically phase defects between synchronous regions, are designed by the evolutionary process to ...

Graphic cryptosystem using memory cellular automata

In this paper, a new graphic cryptosystem based on reversible memory cellular automata is introduced. Its main feature is that the original image and the cipher image are defined by the same palette of colors and that the recovered image is equal to the original one, that is, there is not loss of resolution. Moreover, it is proved that the proposed cryptosystem is secure against brute-force att...

Cellular Automata, Modeling, and Computation

Cellular Automata (CA) based simulations are widely used in a great variety of domains, from statistical physics to social science. They allow for spectacular displays and numerical predictions. Are they for all that a revolutionary modeling tool, allowing for “direct simulation” (Morgan and Morrison 1999, 29), or for the simulation of “the phenomenon itself” (Fox Keller 2003)? Or are they mere...

Cellular Automata with Memory

Reversible Computation in Asynchronous Cellular Automata

Reversible computation has attracted much attention over the years, not only for its promise for computers with radically reduced power consumption, but also for its importance for Quantum Computing. Though studied extensively in a great variety of synchronous computation models, it is virtually unexplored in an asynchronous framework. Particularly suitable asynchronous models for the study of ...